Random Bulgarian solitaire
نویسنده
چکیده
We consider a stochastic variant of the game of Bulgarian solitaire [9]. For the stationary measure of the random Bulgarian solitaire, we prove that most of its mass is concentrated on (roughly) triangular configurations of certain type.
منابع مشابه
A note on random Bulgarian solitaire
We consider a stochastic variant of the game of Bulgarian solitaire [9]. For the stationary measure of the random Bulgarian solitaire, we prove that most of its mass is concentrated on (roughly) triangular configurations of certain type.
متن کاملThe Bulgarian Solitaire and the Mathematics around It
The Bulgarian solitaire is a mathematical card game played by one person. A pack of n cards is divided into several decks (or “piles”). Each move consists of the removing of one card from each deck and collecting the removed cards to form a new deck. The game ends when the same position occurs twice. It has turned out that when n = k(k + 1)/2 is a triangular number, the game reaches the same st...
متن کاملShift-Induced Dynamical Systems on Partitions and Compositions
The rules of “Bulgarian solitaire” are considered as an operation on the set of partitions to induce a finite dynamical system. We focus on partitions with no preimage under this operation, known as Garden of Eden points, and their relation to the partitions that are in cycles. These are the partitions of interest, as we show that starting from the Garden of Eden points leads through the entire...
متن کاملThe Cycling of Partitions and Compositions under Repeated Shifts
In “Bulgarian Solitaire”, a player divides a deck of n cards into piles. Each move consists of taking a card from each pile to form a single new pile. One is concerned only with how many piles there are of each size. Starting from any division into piles, one always reaches some cycle of partitions of n. Brandt proved that for n = 1+2+ · · ·+k, the cycle is just the single partition into piles ...
متن کاملColumn-to-row Operations on Partitions: the Envelopes
Conjugation and the Bulgarian solitaire move are considered as extreme cases of several column-to-row operations on integer partitions. Each operation generates a state diagram on the partitions of n, which leads to the questions: How many Garden of Eden states are there? How many cycle states? How many connected components? All of these questions are answered for partitions of n when at least ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 27 شماره
صفحات -
تاریخ انتشار 2005